Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
نویسندگان
چکیده
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingularity of Clarke’s generalized Jacobian of the KKT nonsmooth system, such as primal and dual constraint nondegeneracy, the strong regularity, and the nonsingularity of the B-subdifferential of the KKT system. This affirmatively answers an open question by Chan and Sun [SIAM J. Optim. 19 (2008), pp. 370-396].
منابع مشابه
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric and positive semidefinite matrices. We show in this paper that the primal and dual constraint nondegeneracies, the strong regularity, the nonsingularity of the B-subdifferential of this nonsmooth system, and the nonsin...
متن کاملNonsingularity conditions for FB system of reformulating nonlinear second - order cone programming 1
This paper is a counterpart of [2]. Specifically, for a locally optimal solution to the nonlinear second-order cone programming (SOCP), under Robinson’s constraint qualification, we establish the equivalence among the following three conditions: the nonsingularity of Clarke’s Jacobian of Fischer-Burmeister (FB) nonsmooth system for the Karush-Kuhn-Tucker conditions, the strong second-order suff...
متن کاملNonsingularity conditions for FB system of nonlinear SDPs 1
For a locally optimal solution to the nonlinear semidefinite programming,under Robinson’s constraint qualification, we show that the nonsingularity of Clarke’sJacobian of the Fischer-Burmeister (FB) nonsmooth system is equivalent to the strongregularity of the Karush-Kuhn-Tucker point. Consequently, from Sun’s paper (Mathe-matics of Operations Research, vol. 31, pp. 761-776, 200...
متن کاملA Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...
متن کاملThe Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson’s constraint qualification, the following conditions are proved to be equivalent: the strong second order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke’s Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 148 شماره
صفحات -
تاریخ انتشار 2011